How Euler Did It by Ed Sandifer Odd Perfect Numbers November 2006 The subject we now call “number theory” was not a very popular one in the 18th century. Euler wrote almost a hundred papers on the subject, but the fi

Source URL: eulerarchive.maa.org

• Integer sequences
• Number theory
• Divisor function
• Algebraic number theory
• Perfect number
• Modular arithmetic
• Amicable numbers
• Divisor
• Prime number
• Quadratic reciprocity
• Leonhard Euler
• Coprime integers

Static Analysis of Finite Precision Computations Eric Goubault and Sylvie Putot CEA LIST, Laboratory for the Modelling and Analysis of Interacting Systems, Point courrier 94, Gif-sur-Yvette, FFrance, Firstname.Las

Source URL: www.lix.polytechnique.fr

• Computer arithmetic
• Abstract interpretation
• Interval arithmetic
• Rounding
• Floating point
• Affine arithmetic
• Interval
• Function
• Limit of a function
• NaN
• Fixed-point arithmetic
• Machine epsilon

Hardest-to-Round Cases Vincent LEFÈVRE Arénaire, INRIA Grenoble – Rhône-Alpes / LIP, ENS-Lyon Journées TaMaDi, Lyon,

Source URL: www.vinc17.org

• Computer arithmetic
• Exponentials
• GNU MPFR
• Double-precision floating-point format
• DWIM
• Exponential function
• Exponentiation

BINARY SOLUTION IN LAW SCHOOLS 

Source URL: www.binarysolution.com

• Binary star
• Exoplanetology
• Binary
• Binary arithmetic
• SpotOption
• Margules function

THE PARTITION FUNCTION AND THE ARITHMETIC OF CERTAIN MODULAR L-FUNCTIONS Li Guo and Ken Ono International Mathematical Research Notes, 21, 1999, pages

Source URL: www.mathcs.emory.edu

TERM EXTRACTION AND RAMSEY’S THEOREM FOR PAIRS ALEXANDER P. KREUZER AND ULRICH KOHLENBACH Abstract. In this paper we study with proof-theoretic methods the function(al)s provably recursive relative to Ramsey’s theore

Source URL: www.mathematik.tu-darmstadt.de

• Proof theory
• Computability theory
• Logic in computer science
• Mathematical logic
• Intuitionism
• Primitive recursive functional
• Dialectica interpretation
• Peano axioms
• Second-order arithmetic
• Reverse mathematics
• Combinatory logic
• Primitive recursive arithmetic

A note on the Π02–induction rule∗ Ulrich Kohlenbach Fachbereich Mathematik, J.W.Goethe-Universit¨at, Robert-Mayer-Strasse 6–10, D–60054 Frankfurt, Germany Abstract It is well–known (due to C. Parsons) that th

Source URL: www.mathematik.tu-darmstadt.de

• Predicate logic
• Computability theory
• Recursion
• Logic
• Theory of computation
• Primitive recursive arithmetic
• Primitive recursive function
• Quantifier
• First-order logic
• Free variables and bound variables
• Herbrandization

Invent. math. 94, Inventione$ mathematicae 9 Springer-Verlag 1988

Source URL: people.mpim-bonn.mpg.de

• Analytic number theory
• Several complex variables
• Modular form
• Hecke operator
• Theta function
• Arithmetic function
• Determinant
• Toledo Nanochess
• Tensor product of modules

Real Growth in Standard Parts of Analysis∗ Ulrich Kohlenbach Fachbereich Mathematik J.W. Goethe Universit¨at Robert-Mayer-StrFrankfurt am Main, Germany

Source URL: www.mathematik.tu-darmstadt.de

• Computability theory
• Functions and mappings
• Recursion
• Theory of computation
• Proof theory
• Primitive recursive function
• Continuous function
• Elementary function arithmetic
• Arithmetic function

The design of the Boost interval arithmetic library ? Herv´e Br¨onnimann a,1 Guillaume Melquiond b,2 Sylvain Pion c,3 a CIS, b Ecole ´

Source URL: www.lri.fr

• Mathematics
• Computer arithmetic
• Arithmetic
• Numerical analysis
• Functions and mappings
• Interval arithmetic
• Interval
• Rounding
• Integral
• GNU MPFR
• Mode
• Function